On redundancy elimination tolerant scheduling rules
نویسندگان
چکیده
منابع مشابه
On redundancy elimination tolerant scheduling rules
In (Ferrucci, Pacini and Sessa, 1995) an extended form of resolution, called Reduced SLD resolution (RSLD), is introduced. In essence, an RSLD derivation is an SLD derivation such that redundancy elimination from resolvents is performed after each rewriting step. It is intuitive that redundancy elimination may have positive effects on derivation process. However, undesiderable effects are also ...
متن کاملRedundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog rules) and constraints (in the form of so-called tuple-generating dependencies), as well as with respect to queries (ranging from conjunctive queries up to more complex ones, particularly covering features of SPARQL, s...
متن کاملRedundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms which are redundant in the sense that they can be recovered from the types of other subterms. This system is capable of omitting more redundant information than previous work in the same vein, because of its uniform tre...
متن کاملLoad Redundancy Elimination on Executable Code
Optimizations performed at link time or directly applied to nal program executables have received increased attention in recent years. This paper discuss the discovery and elimination of redundant load operations in the context of a link time optimizer, an optimization that we call Load Redundancy Elimination (LRE). Our experiments show that between 50% and 75% of a program's memory references ...
متن کاملHigher-Order Redundancy Elimination
Functional programs often de ne functions by pat tern matching where patterns may inadvertedly overlap through successive function calls This leads to hidden in e ciencies since the recursively called function possibly repeats redundant tests while trying to match the pat tern An analysis which is based on conservative symbolic execution similar to higher order constant propagation is proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2001
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068401001235